Exact Expression For Information Distance
نویسنده
چکیده
Information distance can be defined not only between two strings but also in a finite multiset of strings of cardinality greater than two. We give an elementary proof for expressing the information distance in conditional Kolmogorov complexity. It is exact since the lower bound equals the upper bound up to a constant additive term.
منابع مشابه
Exact L-distance from the Limit for Quicksort
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in Régnier’s [5] classical limit theorem for the number of key comparisons required by QuickSort. A previous study by Fill and Janson [1] using a similar approach found that the d2-distance is of order between n −1 logn and n−1/2, and another by Neininger and Ruschendorf [4] found that the Zolotare...
متن کاملExact L 2 - Distance from the Limit for QuickSort Key Comparisons ( Extended
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in the classical limit theorem of Régnier (1989) for the number of key comparisons required by QuickSort. A previous study by Fill and Janson (2002) using a similar approach found that the d2-distance is of order between n−1 logn and n−1/2, and another by Neininger and Ruschendorf (2002) found that...
متن کاملExact L^2-distance from the limit for QuickSort key comparisons (extended abstract)
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in Régnier’s [5] classical limit theorem for the number of key comparisons required by QuickSort. A previous study by Fill and Janson [1] using a similar approach found that the d2-distance is of order between n −1 log n and n, and another by Neininger and Ruschendorf [4] found that the Zolotarev ζ...
متن کاملExact L-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in the classical limit theorem of Régnier (1989) for the number of key comparisons required by QuickSort. A previous study by Fill and Janson (2002) using a similar approach found that the d2-distance is of order between n−1 logn and n−1/2, and another by Neininger and Ruschendorf (2002) found that...
متن کاملInformation and Covariance Matrices for Multivariate Pareto (IV), Burr, and Related Distributions
Main result of this paper is to derive the exact analytical expressions of information and covariance matrix for multivariate Pareto, Burr and related distributions. These distributions arise as tractable parametric models in reliability, actuarial science, economics, finance and telecommunications. We showed that all the calculations can be obtained from one main moment multidimensional integr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 63 شماره
صفحات -
تاریخ انتشار 2017